0.01/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.01/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.34	% Computer   : n014.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:29:04 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.34	% Number of cores: 8
0.13/0.35	% Python version: Python 3.6.8
0.13/0.35	# Version: 2.6rc1-ho
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 59 seconds
0.13/0.40	# AutoSched0-Mode selected heuristic MinMin_rr
0.13/0.40	# and selection function SelectMaxLComplexAvoidPosPred.
0.13/0.40	#
0.13/0.40	# Preprocessing time       : 0.030 s
0.13/0.40	# Presaturation interreduction done
0.13/0.40	
0.13/0.40	# Proof found!
0.13/0.40	# SZS status Theorem
0.13/0.40	# SZS output start CNFRefutation
0.13/0.40	thf(cTHM90A_pme, conjecture, (![X1:a]:(![X2:a > $o]:(X2 @ X1<=![X3:a]:(X2 @ X3<=cK @ X2 @ X3))=>cK @ (^[X3:a]:![X2:a > $o]:(X2 @ X3<=![X4:a]:(X2 @ X4<=cK @ X2 @ X4))) @ X1)<=![X5:a > $o, X6:a > $o]:(![X1:a]:(X5 @ X1=>X6 @ X1)=>![X1:a]:(cK @ X6 @ X1<=cK @ X5 @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM90A_pme)).
0.13/0.40	thf(c_0_1, plain, ![X3:a]:(epred1_1 @ X3<=>![X2:a > $o]:(![X4:a]:(cK @ X2 @ X4=>X2 @ X4)=>X2 @ X3)), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.13/0.40	thf(c_0_2, negated_conjecture, ~((![X5:a > $o, X6:a > $o]:(![X1:a]:(X5 @ X1=>X6 @ X1)=>![X1:a]:(cK @ X5 @ X1=>cK @ X6 @ X1))=>![X1:a]:(![X2:a > $o]:(![X3:a]:(cK @ X2 @ X3=>X2 @ X3)=>X2 @ X1)=>cK @ epred1_1 @ X1))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM90A_pme]), c_0_1])])).
0.13/0.40	thf(c_0_3, plain, ![X21:a, X22:a > $o, X24:a, X26:a]:(((cK @ X22 @ (esk4_2 @ X21 @ X22)|X22 @ X21|~epred1_1 @ X21)&(~X22 @ (esk4_2 @ X21 @ X22)|X22 @ X21|~epred1_1 @ X21))&((~cK @ (epred2_1 @ X24) @ X26|epred2_1 @ X24 @ X26|epred1_1 @ X24)&(~epred2_1 @ X24 @ X24|epred1_1 @ X24))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.13/0.40	thf(c_0_4, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o]:(((X14 @ (esk1_2 @ X14 @ X15)|(~cK @ X14 @ X17|cK @ X15 @ X17))&(~X15 @ (esk1_2 @ X14 @ X15)|(~cK @ X14 @ X17|cK @ X15 @ X17)))&(((cK @ X19 @ (esk3_1 @ X19)|X19 @ esk2_0)&(~X19 @ (esk3_1 @ X19)|X19 @ esk2_0))&~cK @ epred1_1 @ esk2_0)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
0.13/0.40	thf(c_0_5, plain, ![X1:a, X3:a]:(epred2_1 @ X1 @ X3|epred1_1 @ X1|~cK @ (epred2_1 @ X1) @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.13/0.40	thf(c_0_6, negated_conjecture, ![X2:a > $o]:(cK @ X2 @ (esk3_1 @ X2)|X2 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_4])).
0.13/0.40	thf(c_0_7, negated_conjecture, ![X2:a > $o]:(X2 @ esk2_0|~X2 @ (esk3_1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.13/0.40	thf(c_0_8, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(X2 @ (esk1_2 @ X2 @ X5)|cK @ X5 @ X1|~cK @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_4])).
0.13/0.40	thf(c_0_9, plain, ![X2:a > $o, X1:a]:(cK @ X2 @ (esk4_2 @ X1 @ X2)|X2 @ X1|~epred1_1 @ X1), inference(split_conjunct,[status(thm)],[c_0_3])).
0.13/0.40	thf(c_0_10, plain, ![X1:a]:(epred1_1 @ X1|~epred2_1 @ X1 @ X1), inference(split_conjunct,[status(thm)],[c_0_3])).
0.13/0.40	thf(c_0_11, negated_conjecture, ![X1:a]:(epred2_1 @ X1 @ esk2_0|epred1_1 @ X1), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.13/0.40	thf(c_0_12, plain, ![X5:a > $o, X2:a > $o, X1:a]:(cK @ X2 @ (esk4_2 @ X1 @ X5)|X5 @ (esk1_2 @ X5 @ X2)|X5 @ X1|~epred1_1 @ X1), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.13/0.40	thf(c_0_13, plain, epred1_1 @ esk2_0, inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.13/0.40	thf(c_0_14, plain, ![X2:a > $o, X5:a > $o]:(cK @ X2 @ (esk4_2 @ esk2_0 @ X5)|X5 @ (esk1_2 @ X5 @ X2)|X5 @ esk2_0), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.13/0.40	thf(c_0_15, plain, ![X2:a > $o, X1:a]:(X2 @ X1|~X2 @ (esk4_2 @ X1 @ X2)|~epred1_1 @ X1), inference(split_conjunct,[status(thm)],[c_0_3])).
0.13/0.40	thf(c_0_16, negated_conjecture, ![X2:a > $o, X5:a > $o, X6:a > $o]:(cK @ X2 @ (esk4_2 @ esk2_0 @ (cK @ X5))|cK @ X6 @ (esk1_2 @ (cK @ X5) @ X2)|cK @ X5 @ esk2_0|X5 @ (esk1_2 @ X5 @ X6)), inference(spm,[status(thm)],[c_0_8, c_0_14])).
0.13/0.40	thf(c_0_17, plain, ![X2:a > $o, X5:a > $o]:(cK @ X2 @ (esk1_2 @ (cK @ X5) @ X5)|X5 @ (esk1_2 @ X5 @ X2)|cK @ X5 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_13])])).
0.13/0.40	thf(c_0_18, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(cK @ X2 @ X1|~X2 @ (esk1_2 @ X5 @ X2)|~cK @ X5 @ X1), inference(split_conjunct,[status(thm)],[c_0_4])).
0.13/0.40	thf(c_0_19, plain, ![X1:a, X3:a]:(epred2_1 @ X1 @ X3|epred1_1 @ X1|~epred1_1 @ X3), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_9]), c_0_15])).
0.13/0.40	thf(c_0_20, plain, ![X2:a > $o, X1:a]:(epred2_1 @ X1 @ (esk1_2 @ (cK @ X2) @ X2)|X2 @ (esk1_2 @ X2 @ (epred2_1 @ X1))|cK @ X2 @ esk2_0|epred1_1 @ X1), inference(spm,[status(thm)],[c_0_5, c_0_17])).
0.13/0.40	thf(c_0_21, negated_conjecture, ![X1:a, X2:a > $o, X3:a]:(cK @ (epred2_1 @ X1) @ X3|epred1_1 @ X1|~epred1_1 @ (esk1_2 @ X2 @ (epred2_1 @ X1))|~cK @ X2 @ X3), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.13/0.40	thf(c_0_22, plain, ![X2:a > $o]:(X2 @ (esk1_2 @ X2 @ (epred2_1 @ (esk1_2 @ (cK @ X2) @ X2)))|epred1_1 @ (esk1_2 @ (cK @ X2) @ X2)|cK @ X2 @ esk2_0), inference(spm,[status(thm)],[c_0_10, c_0_20])).
0.13/0.40	thf(c_0_23, negated_conjecture, ~cK @ epred1_1 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_4])).
0.13/0.40	thf(c_0_24, negated_conjecture, ![X1:a]:(cK @ (epred2_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)) @ X1|epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)|~cK @ epred1_1 @ X1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
0.13/0.40	thf(c_0_25, plain, ![X1:a]:(epred2_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1) @ X1|epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)|~cK @ epred1_1 @ X1), inference(spm,[status(thm)],[c_0_5, c_0_24])).
0.13/0.40	thf(c_0_26, plain, (epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)|~cK @ epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)), inference(spm,[status(thm)],[c_0_10, c_0_25])).
0.13/0.40	thf(c_0_27, negated_conjecture, ![X2:a > $o, X5:a > $o]:(cK @ X2 @ (esk3_1 @ X5)|X5 @ (esk1_2 @ X5 @ X2)|X5 @ esk2_0), inference(spm,[status(thm)],[c_0_8, c_0_6])).
0.13/0.40	thf(c_0_28, negated_conjecture, (cK @ epred1_1 @ (esk3_1 @ (cK @ epred1_1))|epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_23])).
0.13/0.40	thf(c_0_29, negated_conjecture, ![X1:a]:(cK @ epred1_1 @ (esk3_1 @ (cK @ epred1_1))|cK @ epred1_1 @ X1|~cK @ (cK @ epred1_1) @ X1), inference(spm,[status(thm)],[c_0_18, c_0_28])).
0.13/0.40	thf(c_0_30, negated_conjecture, cK @ epred1_1 @ (esk3_1 @ (cK @ epred1_1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_6]), c_0_23])).
0.13/0.40	thf(c_0_31, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_30]), c_0_23]), ['proof']).
0.13/0.40	# SZS output end CNFRefutation
0.13/0.40	# Proof object total steps             : 32
0.13/0.40	# Proof object clause steps            : 27
0.13/0.40	# Proof object formula steps           : 5
0.13/0.40	# Proof object conjectures             : 17
0.13/0.40	# Proof object clause conjectures      : 14
0.13/0.40	# Proof object formula conjectures     : 3
0.13/0.40	# Proof object initial clauses used    : 9
0.13/0.40	# Proof object initial formulas used   : 1
0.13/0.40	# Proof object generating inferences   : 18
0.13/0.40	# Proof object simplifying inferences  : 8
0.13/0.40	# Training examples: 0 positive, 0 negative
0.13/0.40	# Parsed axioms                        : 3
0.13/0.40	# Removed by relevancy pruning/SinE    : 0
0.13/0.40	# Initial clauses                      : 11
0.13/0.40	# Removed in clause preprocessing      : 2
0.13/0.40	# Initial clauses in saturation        : 9
0.13/0.40	# Processed clauses                    : 130
0.13/0.40	# ...of these trivial                  : 0
0.13/0.40	# ...subsumed                          : 23
0.13/0.40	# ...remaining for further processing  : 107
0.13/0.40	# Other redundant clauses eliminated   : 10
0.13/0.40	# Clauses deleted for lack of memory   : 0
0.13/0.40	# Backward-subsumed                    : 4
0.13/0.40	# Backward-rewritten                   : 7
0.13/0.40	# Generated clauses                    : 712
0.13/0.40	# ...of the previous two non-trivial   : 585
0.13/0.40	# Contextual simplify-reflections      : 18
0.13/0.40	# Paramodulations                      : 618
0.13/0.40	# Factorizations                       : 4
0.13/0.40	# NegExts                              : 8
0.13/0.40	# Equation resolutions                 : 10
0.13/0.40	# Propositional unsat checks           : 0
0.13/0.40	#    Propositional check models        : 0
0.13/0.40	#    Propositional check unsatisfiable : 0
0.13/0.40	#    Propositional clauses             : 0
0.13/0.40	#    Propositional clauses after purity: 0
0.13/0.40	#    Propositional unsat core size     : 0
0.13/0.40	#    Propositional preprocessing time  : 0.000
0.13/0.40	#    Propositional encoding time       : 0.000
0.13/0.40	#    Propositional solver time         : 0.000
0.13/0.40	#    Success case prop preproc time    : 0.000
0.13/0.40	#    Success case prop encoding time   : 0.000
0.13/0.40	#    Success case prop solver time     : 0.000
0.13/0.40	# Current number of processed clauses  : 82
0.13/0.40	#    Positive orientable unit clauses  : 4
0.13/0.40	#    Positive unorientable unit clauses: 0
0.13/0.40	#    Negative unit clauses             : 1
0.13/0.40	#    Non-unit-clauses                  : 77
0.13/0.40	# Current number of unprocessed clauses: 473
0.13/0.40	# ...number of literals in the above   : 2701
0.13/0.40	# Current number of archived formulas  : 0
0.13/0.40	# Current number of archived clauses   : 25
0.13/0.40	# Clause-clause subsumption calls (NU) : 1641
0.13/0.40	# Rec. Clause-clause subsumption calls : 511
0.13/0.40	# Non-unit clause-clause subsumptions  : 38
0.13/0.40	# Unit Clause-clause subsumption calls : 27
0.13/0.40	# Rewrite failures with RHS unbound    : 0
0.13/0.40	# BW rewrite match attempts            : 4
0.13/0.40	# BW rewrite match successes           : 3
0.13/0.40	# Condensation attempts                : 0
0.13/0.40	# Condensation successes               : 0
0.13/0.40	# Termbank termtop insertions          : 20419
0.13/0.41	
0.13/0.41	# -------------------------------------------------
0.13/0.41	# User time                : 0.054 s
0.13/0.41	# System time              : 0.004 s
0.13/0.41	# Total time               : 0.058 s
0.13/0.41	# Maximum resident set size: 1648 pages
0.13/0.41	EOF